Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
نویسندگان
چکیده
Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally well on many graphs and better for sparse random graphs. In this work we show three main results for the quasirandom rumor spreading model. We exhibit a natural expansion property for networks which suffices to make quasirandom rumor spreading inform all nodes of the network in logarithmic time with high probability. This expansion property is satisfied, among others, by many expander graphs, random regular graphs, and Erdős-Rényi random graphs. For all network topologies, we show that if one of the push or pull model works well, so does the other. We also show that quasirandom rumor spreading is robust against transmission failures. If each message sent out gets lost with probability f , then the runtime increases only by a factor ofO(1/(1 − f)).
منابع مشابه
A Quasirandom Rumor Spreading
Randomized rumor spreading or random phone call protocols are simple randomized epidemic algorithms designed to distribute a piece of information in a network. They build on the basic paradigm that informed vertices call random neighbors to inform them (push model), or that uninformed vertices call random neighbors to become informed if the neighbor is (pull model). Despite the simple concept, ...
متن کاملStrong Robustness of Randomized Rumor Spreading Protocols
Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its runtime were proven. This prompts the question: to what extent does the quasirandom protocol inherit the second principal advantage of randomized rumor spreading, namely robustness against transmission fa...
متن کاملPull and Push&Pull in Random Evolving Graphs
The Push, the Pull and the Push&Pull algorithms are well-known rumor spreading protocols. In all three, in the beginning one node of a graph is informed. In the Push setting, every round every informed node chooses a neighbor uniformly at random and, if it is not already informed anyway, informs it. In the Pull setting, each round each uninformed node chooses a neighbor uniformly at random and ...
متن کاملTight bounds for rumor spreading in graphs of a given conductance
We study the connection between the rate at which a rumor spreads throughout a graph and the conductance of the graph—a standard measure of a graph’s expansion properties. We show that for any n-node graph with conductance φ, the classical PUSH-PULL algorithm distributes a rumor to all nodes of the graph in O(φ−1 log n) rounds with high probability (w.h.p.). This bound improves a recent result ...
متن کاملBreaking the log n barrier on rumor spreading
O(log n) rounds has been a well known upper bound for rumor spreading using push&pull in the random phone call model (i.e., uniform gossip in the complete graph). A matching lower bound of Ω(logn) is also known for this special case. Under the assumption of this model and with a natural addition that nodes can call a partner once they learn its address (e.g., its IP address) we present a new di...
متن کامل